Combinatorics of Jacobi-configurations III: The Srivastava-Singhal generating function revisited
نویسندگان
چکیده
منابع مشابه
The function ring functors of pointfree topology revisited
This paper establishes two new connections between the familiar function ring functor ${mathfrak R}$ on the category ${bf CRFrm}$ of completely regular frames and the category {bf CR}${mathbf sigma}${bf Frm} of completely regular $sigma$-frames as well as their counterparts for the analogous functor ${mathfrak Z}$ on the category {bf ODFrm} of 0-dimensional frames, given by the integer-valued f...
متن کاملJacobi Quartic Curves Revisited
This paper provides new results about efficient arithmetic on (extended) Jacobiquartic form elliptic curves y = dx + 2ax + 1. Recent works have shown thatarithmetic on an elliptic curve in Jacobi quartic form can be performed solidly fasterthan the corresponding operations in Weierstrass form. These proposals use up to 7coordinates to represent a single point. However, fast scal...
متن کاملAnalytic combinatorics of non-crossing configurations
This paper describes a systematic approach to the enumeration of 'non-crossing' geometric configurations built on vertices of a convex n-gon in the plane. It relies on generating functions, symbolic methods, singularity analysis, and singularity perturbation. Consequences are both exact and asymptotic counting results for trees, forests, graphs, connected graphs, dissections, and partitions. Li...
متن کاملGenerating Functions of Jacobi Polynomials
Multiplicative renormalization method (MRM) for deriving generating functions of orthogonal polynomials is introduced by Asai–Kubo– Kuo. They and Namli gave complete lists of MRM-applicable measures for MRM-factors h(x) = ex and (1 − x)−κ. In this paper, MRM-factors h(x) for which the beta distribution B(p, q) over [0, 1] is MRM-applicable are determined. In other words, all generating function...
متن کاملThe number of convex polyominoes and the generating function of Jacobi polynomials
Lin and Chang gave a generating function of convex polyominoes with an m+1 by n + 1 minimal bounding rectangle. Gessel showed that their result implies that the number of such polyominoes is m+ n+mn m+ n ( 2m+ 2n 2m ) − 2mn m+ n ( m+ n m )2 . We show that this result can be derived from some binomial coefficients identities related to the generating function of Jacobi polynomials. Some (binomia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1988
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90151-3